ACS Algorithms for Complex Shapes with Certified Numerics and Topology Seed polytopes for incremental approximations of general surfaces in 3D
نویسندگان
چکیده
Approximating a given three-dimensional object in order to simplify its handling is a classical topic in computational geometry and related fields. A typical approach is based on incremental approximation algorithms, which start with a small and topologically correct polytope representation (the seed polytope) of a given sample point cloud or input mesh. In addition, a correspondence between the faces of the polytope and the respective regions of the object boundary is needed to guarantee correctness. We construct such a polytope by first computing a simplified though still homotopy equivalent medial axis transform of the input object. Then, we inflate this medial axis to a polytope of small size. Since our approximation maintains topology, the simplified medial axis transform is also useful for skin surfaces and envelope surfaces.
منابع مشابه
ACS Algorithms for Complex Shapes with Certified Numerics and Topology Review of CGAL package for skin surface meshing
This report includes a review about the first submission of the CGAL package for isotopic meshing of skin surfaces. It provides some suggestions, namely to simplify the user interface of the package and also to make skin surfaces compatible with the CGAL 3D Surface Mesher package.
متن کاملACS Algorithms for Complex Shapes with Certified Numerics and Topology Application of algebraic tools to CSG operations on curves and surfaces
متن کامل
ACS Algorithms for Complex Shapes with Certified Numerics and Topology FPG: A code generator for fast and certified geometric predicates
We present a general purpose code analyzer/generator for filtered predicates, which are critical for geometric algorithms. While there already exist such code generators, our contribution is to generate ”almost static filters”, a type of filter which could not be generated previously. The generated and safe filtered predicates are almost as fast as their inexact floating point counterparts, in ...
متن کاملACS Algorithms for Complex Shapes with Certified Numerics and Topology Algebraic tools for 3 D problems , related to the topology of implicit
In this work, we propose an algorithm based on subresultants computation to compute the topology of implicit curves defined as intersection of implicit surfaces. Our approach is symbolic-numeric, but certification of the result can be obtained from the simplification of the generic position testing. To check the generic position, our approach treats together a familly of critical points, making...
متن کاملACS Algorithms for Complex Shapes with Certified Numerics and Topology Computation of the medial axis of smooth curves with topological guarantees
Project co-funded by the European Commission within FP6 (2002–2006) under contract nr. IST-006413
متن کامل